Subgraph nomination: query by example subgraph retrieval in networks
نویسندگان
چکیده
This paper introduces the subgraph nomination inference task, in which example subgraphs of interest are used to query a network for similarly interesting subgraphs. type problem appears time and again real world problems connected to, example, user recommendation systems structural retrieval tasks social biological/connectomic networks. We formally define framework with an emphasis on notion user-in-the-loop pipeline. In this setting, can provide additional post-nomination light supervision that be incorporated into task. After introducing formalizing we examine nuanced effect user-supervision have performance, both analytically across simulated data examples.
منابع مشابه
Subgraph Isomorphism in Temporal Networks
Temporal information is increasingly available as part of large network data sets. This information reveals sequences of link activations between network entities, which can expose underlying processes in the data. Examples include the dissemination of information through a social network, the propagation of musical ideas in a music sampling network, and the spread of a disease via contacts bet...
متن کاملSubgraph centrality in complex networks.
We introduce a new centrality measure that characterizes the participation of each node in all subgraphs in a network. Smaller subgraphs are given more weight than larger ones, which makes this measure appropriate for characterizing network motifs. We show that the subgraph centrality [C(S)(i)] can be obtained mathematically from the spectra of the adjacency matrix of the network. This measure ...
متن کاملMulti-Query Optimization for Subgraph Isomorphism Search
Existing work on subgraph isomorphism search mainly focuses on a-query-at-a-time approaches: optimizing and answering each query separately. When multiple queries arrive at the same time, sequential processing is not always the most efficient. In this paper, we study multi-query optimization for subgraph isomorphism search. We first propose a novel method for efficiently detecting useful common...
متن کاملTaming Subgraph Isomorphism for RDF Query Processing
RDF data are used to model knowledge in various areas such as life sciences, Semantic Web, bioinformatics, and social graphs. The size of real RDF data reaches billions of triples. This calls for a framework for efficiently processing RDF data. The core function of processing RDF data is subgraph pattern matching. There have been two completely different directions for supporting efficient subg...
متن کاملBetween Subgraph Isomorphism and Maximum Common Subgraph
When a small pattern graph does not occur inside a larger target graph, we can ask how to find “as much of the pattern as possible” inside the target graph. In general, this is known as the maximum common subgraph problem, which is much more computationally challenging in practice than subgraph isomorphism. We introduce a restricted alternative, where we ask if all but k vertices from the patte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics and Computing
سال: 2023
ISSN: ['0960-3174', '1573-1375']
DOI: https://doi.org/10.1007/s11222-023-10206-6